Eta-Redexes in Partial Evaluation
نویسنده
چکیده
Source-program modifications can make a partial evaluator yield dramatically better results. For example, eta-redexes can preserve static data flow by acting as an interface between values and contexts. This note presents a type-based explanation of what eta-expansion achieves, why it works, and how it can be automated. This leads to a unified view of various source-code improvements, including a popular transformation called “The Trick.”
منابع مشابه
The Essence of Eta-Expansion in Partial Evaluation
Selective eta expansion is a powerful binding time improve ment i e a source program modi cation that makes a partial evaluator yield better results But like most binding time improvements the exact problem it solves and the rea son why have not been formalized and are only understood by few In this paper we describe the problem and the e ect of eta redexes in terms of monovariant binding time ...
متن کاملExplicit Substitutions Calculi with Explicit Eta Rules
It has been argued that the notion of substitution in the λ-calculus needs to be made explicit and many calculi have been developed in which the computational steps of the substitution operation involved in β-contractions have been atomised. In contrast to the great variety of developments for making explicit formalisations of the Beta rule, less work has been done for giving explicit definitio...
متن کاملoes T he T rick ( R evised V ersion ) BRICS Basic Research in Computer Science Eta - Expansion Does The Trick ( Revised
Partial-evaluation folklore has it that massaging one’s source programs can make them specialize better. In Jones, Gomard, and Sestoft’s recent textbook, a whole chapter is dedicated to listing such “binding-time improvements”: nonstandard use of continuationpassing style, eta-expansion, and a popular transformation called “The Trick”. We provide a unified view of these binding-time improvement...
متن کاملSequentiality, Second Order Monadic Logic and Tree Automata
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. L evy deene in 9] the sequentiality of a predicate P on partially evaluated terms. We show ...
متن کاملEncoding Turing Machines into the Deterministic Lambda-Calculus
1. Weakly strategy independent : the image of the encoding is a very small fragment of the λ-calculus, that we call the deterministic λ-calculus Λdet. Essentially, it is the CPS (continuation-passing style) λ-calculus restricted to weak evaluation (i.e., not under abstractions). In Λdet every term has at most one redex, and so all weak strategies collapse into a single deterministic evaluation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998